Firmness Analysis of Real-time Tasks

Stochastic Analysis of Buffer–less Pipelines of Real–Time Tasks

In this paper, we consider real–time applications consisting of multiple tasks, which are executed on computing cores managed by a resource reservatin scheduler. The tasks are organised in a linear topology (pipeline). The result produced by a task as a result of one of its activations is used as input for the task at the next stage of the pipeline. The time required for each execution of a tas...

A Generic Approach to Schedulability Analysis of Real-Time Tasks

In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with fixed rates. To relax the assumption of complete knowledge on arrival times, we propose to use timed automata to describe task arrival patterns. In a recent work, it is shown that for fixed priority scheduling strategy and tasks with only timing constraints (i.e. executi...

Best Case Response Time Analysis for Improved Schedulability Analysis of Distributed Real-Time Tasks

In distributed real-time systems, a task activated periodically by the completion of its preceding task can be modeled as a periodic task with activation jitter. An activation jitter of a task is defined as the difference between the worst case and best case response times of its preceding task. Because current approaches assume that the best case response time is zero or much smaller than the ...

Parametric Dispatching of Hard Real-Time Tasks

In many real-time systems, relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks and deriving their proper start-time assignments is a NP-hard problem; it subsumes the Non-preemptive Scheduling Problem. If a total order is imposed on the tasks and the exact execution times of tasks are known a priori, we can statically determine feasible start ti...

Online Admission of Parallel Real-Time Tasks